A fast natural algorithm for searching

A fast natural algorithm for searching

In this note we present two natural algorithms—one for sorting, and another for searching a sorted list of items. Both algorithms work in O( √ N ) time, N being the size of the list. A combination of these algorithms can search an unsorted list in O( √ N ) time, an impossibility for classical algorithms. The same complexity is achieved by Grover’s quantum search algorithm; in contrast to Grover...

A Fast Natural Algorithm for Searching: Preliminary version

In this note we present two natural algorithms—one for sorting and another for searching a sorted list of items. Both algorithms work in O( √ N) time, N being the size of the list. A combination of these algorithms can search an unsorted list in O( √ N) time, an impossibility for classical algorithms. The same complexity is achieved by Grover’s quantum search algorithm; in contrast to Grover’s ...

A Fast Algorithm for Multi-pattern Searching

A new algorithm to search for multiple patterns at the same time is presented. The algorithm is faster than previous algorithms and can support a very large number — tens of thousands — of patterns. Several applications of the multi-pattern matching problem are discussed. We argue that, in addition to previous applications that required such search, multi-pattern matching can be used in lieu of...

A New Fast Data Encryption Algorithm (FDE)

A general compression algorithm that supports fast searching

The task of compressed pattern matching [2] is to report all the occurences of a given pattern P in a text T available in compressed form. Certain compression algorithms allow for searching without prior decoding which may be practical, especially if the search is faster than in the non-compressed representation. Most of the known schemes, however, either assume a text formed into words, or are...